binary space partitioning tree造句

In this case, Binary space partitioning trees provide a viable, efficient and simple algorithm for checking if a point is embedded in the scenery or not.
However all this was quite computationally expensive, because ideally binary space partitioning tree to reduce the amount of time spent determining which patches are completely hidden from others in complex scenes; but even so, the time spent to determine the form factor still typically scales as " n " log " n ".
In computer science, a " "'k "-d tree "'( short for " k-dimensional space . " k "-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key ( e . g . range searches and nearest neighbor searches ) . " k "-d trees are a special case of binary space partitioning trees.
It's difficult to find binary space partitioning tree in a sentence. 用binary space partitioning tree造句挺难的